60. Permutation Sequence - LeetCode Solution

class Solution:
    def getPermutation(self, n: int, k: int) -> str:
        nums = [str(x) for x in range(1, n + 1)]
        answer = ""
        while nums:
            c = len(nums)
            cfac = 1
            for num in range(1, c + 1):
                cfac *= num
            save = 1
            for index in range(1, cfac + 1, cfac//c):
                save = index
                if k > index - 1 and k < index + (cfac/c):
                    break
            get = int((save - 1)/(cfac/c))
            next = nums[get]
            answer += next
            nums.pop(get)
            k = k - (save - 1)
        return answer